New hyperbolic source density models for blind source recovery score functions

نویسندگان

  • Khurram Waheed
  • Fathi M. Salem
چکیده

We present two new hyperbolic source probability models to effectively represent sub-gaussian and super-gaussian families of sources for dynamic and convolutive Blind Source Recovery (BSR). Both models share a common boundary for the gaussian density function. The proposed hyperbolic probability model for the sub-gaussian densities is an extension of the Pearson density model. The model can represent a broader range of sub-gaussian densities including multi-modal densities as compared to the original Pearson Model. Similarly, the proposed super-gaussian model is an extension of the generalized hyperbolic-Cauchy density function with an added degree of freedom. Combining these two proposed models we propose an adaptive score function for Blind Source Recovery from mixtures of multiple (and unknown) source densities. An adaptive algorithm, to determine the regulation parameters for the proposed score function, using the batch kurtosis of BSR output is also presented. The primary advantage of the proposed online parameter estimation is that it renders the adaptive estimation of the demixing network to be completely blind. The proposed algorithms have been extensively used in multi-distribution convolutive Blind Source Recovery problems [6, 8].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mixture of Generalized Gamma Density-Based Score Function for Fastica

We propose an entirely novel family of score functions for blind signal separation BSS , based on the family of mixture generalized gamma density which includes generalized gamma, Weilbull, gamma, and Laplace and Gaussian probability density functions. To blindly extract the independent source signals, we resort to the FastICA approach, whilst to adaptively estimate the parameters of such score...

متن کامل

Blind Signal Separation Using an Extended Infomax Algorithm

The Infomax algorithm is a popular method in blind source separation problem. In this article an extension of the Infomax algorithm is proposed that is able to separate mixed signals with any sub- or super-Gaussian distributions. This ability is the results of using two different nonlinear functions and new coefficients in the learning rule. In this paper we show how we can use the distribution...

متن کامل

Blind Signal Separation Using an Extended Infomax Algorithm

The Infomax algorithm is a popular method in blind source separation problem. In this article an extension of the Infomax algorithm is proposed that is able to separate mixed signals with any sub- or super-Gaussian distributions. This ability is the results of using two different nonlinear functions and new coefficients in the learning rule. In this paper we show how we can use the distribution...

متن کامل

Blind Source Separation Using Maximum Entropy Pdf Estimation Based on Fractional Moments

Recovering a set of independent sources which are linearly mixed is the main task of the blind source separation. Utilizing different methods such as infomax principle, mutual information and maximum likelihood leads to simple iterative procedures such as natural gradient algorithms. These algorithms depend on a nonlinear function (known as score or activation function) of source distributions....

متن کامل

Adaptive Blind Signal and Image Processing

In this book, we describe various approaches, methods and techniques to blind and semi-blind signal processing, especially principal and independent component analysis, blind source separation, blind source extraction, multichannel blind deconvolution and equalization of source signals when the measured sensor signals are contaminated by additive noise. Emphasis is placed on an information-theo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003